Adjusting the Workload of an Under-utilized Server by Scheduling Supplementary Work
نویسندگان
چکیده
This paper addresses an important question of how to achieve an appropriate and nearly uniform work-load for an under-utilized staff in a waiting line situation by scheduling an appropriate amount of supplementary work during the idle time. We present an M/G/1 queue with a special server’s vacation policy to model this situation. In this system, after serving all arriving customers, the server can perform a random maximum number H of possible supplementary jobs before staying idle. The distribution of H can be determined by a supplementary job assignment policy to reduce the idle time proportion. Major performance measures are obtained to evaluate this class of policies. Numerical examples are presented to illustrate the application of this study. KeywordsScheduling, M/G/1 queue, Server vacations, Idle-time utilization, Stochastic decomposition property ∗ Corresponding author’s email: [email protected] 1813-713X copyright © 2006 ORSTW International Journal of Operations Research
منابع مشابه
Regulating workload in J2EE Application Servers
In this project, we design and implement flow control in a J2EE application server by applying control theory and dynamic probabilistic scheduling. The goal is to regulate workload at the web front end to prevent overloading the shared database, while keeping fairness over all requests. Since workload in an enterprise application has a much larger variance in terms of resource demand, classical...
متن کاملDynamic Scheduling for Parallel Server Systems in Heavy Traffic: Graphical Structure, Decoupled Workload Matrix and Some Sufficient Conditions for Solvability of the Brownian Control Problem
We consider a problem of dynamic scheduling for parallel server systems. With the exception of a few special cases, such stochastic control problems cannot be solved exactly. Here we focus on an approach pioneered by J. M. Harrison that utilizes approximating diffusion control problems. This approach has been very successfully used in the special case when the diffusion control problem can be r...
متن کاملHeavy traffic analysis for EDF queues with reneging
This paper presents a heavy-traffic analysis of the behavior of a single-server queue under an Earliest-Deadline-First (EDF) scheduling policy, in which customers have deadlines and are served only until their deadlines elapse. The performance of the system is measured by the fraction of reneged work (the residual work lost due to elapsed deadlines), which is shown to be minimized by the EDF po...
متن کاملRobust Aperiodic Scheduling under Dynamic
When hard periodic and rm aperiodic tasks are jointly scheduled in the same system, the processor workload can vary according to the arrival times of aperiodic requests. In order to guarantee the schedulability of the periodic task set, in overload conditions some aperiodic tasks must be rejected. In this paper we propose a technique that, in overload conditions, adds ro-bustness to the joint s...
متن کاملCo-Scheduling of Disk Head Time in Cluster-Based Storage (CMU-PDL-08-113)
Disk timeslicing is a promising technique for storage performance insulation. To work with cluster-based storage, however, timeslices associated with striped data must be co-scheduled on the corresponding servers. This paper describes algorithms for determining global timeslice schedules and mechanisms for coordinating the independent server activities. Experiments with a prototype show that, c...
متن کامل